Well Behaved RDF: A Straw-Man Proposal for Taming Blank Nodes
نویسنده
چکیده
The RDF language (Resource Description Framework) allows nodes in an RDF graph to be unlabeled – “blank nodes”. While blank nodes and certain other features are convenient for RDF authors, their unrestricted use causes complications to RDF consumers, such as when attempting to compare RDF graphs, which in the general case is as difficult as the graph isomorphism problem. This paper proposes a straw-man profile of the RDF language – Well Behaved RDF – that constrains the use of certain features (notably blank nodes) to facilitate simpler RDF processing.
منابع مشابه
I4-D14 Exploring and Taming Existence in Rule-based RDFQueries
RDF is an emerging knowledge representation formalism proposed by the W3C. A central feature of RDF are blank nodes, which allow to assert the existence of an entity without naming for it. Despite the importance of blank nodes for RDF, many existing RDF query language have only insu cient support for blank nodes. We propose a query language for RDF, called RDFLog, with extensive blank node supp...
متن کاملTaming Existence in RDF Querying
We introduce the recursive, rule-based RDF query language RDFLog. RDFLog extends previous RDF query languages by arbitrary quantifier alternation: blank nodes may occur in the scope of all, some, or none of the universal variables of a rule. In addition RDFLog is aware of important RDF features such as the distinction between blank nodes, literals and URIs or the RDFS vocabulary. The semantics ...
متن کاملSemantics of Constraints in RDFS
We study constraints for RDF-Schema (RDFS) graphs. The syntax and semantics is defined for constraints in graphs that can contain RDFS properties and blank nodes. The proposal for constraint satisfaction closely resembles the possible world approach found in various contexts of incomplete databases and knowledge bases. Positive decidability results for checking satisfaction of RDFS constraints ...
متن کاملRDFLog: It’s like Datalog for RDF
RDF data is set apart from relational or XML data by its support of rich existential information in the form of blank nodes. Where in SQL databases null values are scoped over a single tuple, blank nodes in RDF can span over any number of statements and thus can be seen as existentially quantified variables. Blank node querying is considered in most RDF query languages, but blank node construct...
متن کاملEverything you always wanted to know about blank nodes
In this paper we thoroughly cover the issue of blank nodes, which have been defined in RDF as ‘existential variables’. We first introduce the theoretical precedent for existential blank nodes from first order logic and incomplete information in database theory. We then cover the different (and sometimes incompatible) treatment of blank nodes across the W3C stack of RDF-related standards. We pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012